Fast Parallel String Pre x-Matching
نویسنده
چکیده
An O(log log m) time n logm log logm-processor CRCW-PRAM algorithm for the string preex-matching problem over general alphabets is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log m log logm processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the same number of operations.
منابع مشابه
Faster Multiple Pattern Matching System on GPU based on Bit-Parallelism
In this paper, we propose fast string matching system using GPU for large scale string matching. The key of our proposed system is the use of bit-parallel pattern matching approach for compact NFA representation and fast simulation of NFA transition on GPU. In the experiments, we show the usefulness of our proposed pattern matching system.
متن کاملA fast parallel algorithm to determine edit distance
We consider the problem of determining in parallel the cost of converting a source string to a destination string by a sequence of insert, delete and transform operations. Each operation has an integer cost in some fixed range. We present an algorithm that runs in <9(logmlogrt) time and uses mn processors on a CRCW PRAM, where m and n are the lengths of the strings. The best known sequential al...
متن کاملParallel String Matching Problems with Computing Models - An Analysis of the Most Recent Studies
We survey the current techniques to handle with the problem of parallel string matching with computing models. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on current developments of parallel string matching, computing models, and the central ideas of the algorithms and their complexities. We presen...
متن کاملOptimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a suu-ciently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The ...
متن کاملDesign of a high speed string matching co-processor for NLP
In this project we try to introduce an efficient way for string matching. We use parallel processing for fast matching and have organized the lexicon in least space using manner (Here we assume that all length words are equally predominant in the input text). This idea is not limited to English, any language text can use it, as matching finally boils down to character matching.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995